-
1 recursively enumerable subset
Математика: рекурсивно перечислимое подмножествоУниверсальный англо-русский словарь > recursively enumerable subset
-
2 recursively enumerable subset
English-Russian scientific dictionary > recursively enumerable subset
-
3 recursively
1) рекурсно
2) рекурсивно
3) рекуррентно ∙ completely recursively enumerable class ≈ вполне рекурсивно перечислимый класс general recursively inequal numbers ≈ общерекурсивно неравные числа general recursively irrational number ≈ общерекурсивно иррациональное число general recursively true ≈ общерекурсивно истинный general recursively true formula ≈ общерекурсивно истинная формула primitive recursively true ≈ примитивно-рекурсивно истинный recursively approximable set ≈ рекурсивно аппроксимируемое множество recursively axiomatizable theor ≈ рекурсивно аксиоматизируемая теория recursively axiomatized theor ≈ рекурсивно аксиоматизированная теория recursively bounded quantifier ≈ рекурсивно ограниченный квантор recursively calculable function ≈ рекурсивно вычислимая функция recursively complex number ≈ рекурсивно комплексное число recursively continuous function ≈ рекурсивно непрерывная функция recursively convergent function ≈ рекурсивно сходящаяся функция recursively convergent sequence ≈ рекурсивно сходящаяся последовательность recursively creative set ≈ рекурсивно креативное множество recursively defined function ≈ рекуррентно определенная функция recursively defined sequence ≈ рекурсивно определенная последовательность recursively differentiable function ≈ рекурсивно дифференцируемая функция recursively divergent function ≈ рекурсивно расходящаяся функция recursively divergent sequence ≈ рекурсивно расходящаяся последовательность recursively enumerable cylinder ≈ рекурсивно перечислимый цилиндр recursively enumerable degree ≈ рекурсивно перечислимая степень recursively enumerable index ≈ рекурсивно перечислимый индекс recursively enumerable ordinal ≈ рекурсивно перечислимое порядковое число recursively enumerable predicate ≈ рекурсивно перечислимый предикат recursively enumerable problem ≈ рекурсивно перечислимая проблема recursively enumerable relation ≈ рекурсивно перечислимое отношение recursively enumerable sequence ≈ рекурсивно перечислимая последовательность recursively enumerable set ≈ рекурсивное перечислимое множество recursively enumerable structure ≈ рекурсивно перечислимая структура recursively enumerable subclass ≈ рекурсивно перечислимый подкласс recursively enumerable subset ≈ рекурсивно перечислимое подмножество recursively enumerable theor ≈ рекурсивно перечислимая теория recursively equivalent sets ≈ рекурсивно эквивалентные множества recursively extensible function ≈ рекурсивно продолжаемая функция recursively incompletable theor ≈ рекурсивно непополнимая теория recursively indecomposable set ≈ рекурсивно неразложимое множество recursively inseparable sets ≈ рекурсивно неотделимые множества recursively invariant concept ≈ рекурсивно инвариантное понятие recursively invariant relation ≈ рекурсивно инвариантное отношение recursively isomorphic set ≈ рекурсивно изоморфное множество recursively presentable structure ≈ рекурсивно представимая структура recursively presented group ≈ рекурсивно определенная группа recursively productive set ≈ рекурсивно продуктивное множество recursively real number ≈ рекурсивно вещественное число recursively related system of notation ≈ рекурсивная по упорядочению система обозначений recursively representable operation ≈ рекурсивно представимая операция recursively representable relation ≈ рекурсивно представимое отношение recursively separable sets ≈ рекурсивно отделимые множества recursively solvable problem ≈ рекурсивно разрешимая проблема recursively undecidable theor ≈ рекурсивно неразрешимая теория recursively unequal numbers ≈ рекурсивно неравные числа - recursively axiomatized - recursively calculable - recursively closed - recursively computable - recursively conditional - recursively continuous - recursively convergent - recursively differentiable - recursively divergent - recursively enumerable - recursively equivalent - recursively expressible - recursively extensible - recursively inseparable - recursively isomorphic - recursively isotonic - recursively presentable - recursively projective - recursively realizable - recursively representable - recursively soluble - recursively true - recursively unsolvable РекурсивноБольшой англо-русский и русско-английский словарь > recursively
-
4 subset
1) телефон. абонентский аппарат2) подгруппа3) подкласс4) подмножество5) полукомплект•- almost open subset - almost unitary subset - bounded below subset - countably paracompact subset - everywhere dense subset - linearly independent subset - locally closed subset - locally polyhedral subset - locally tame subset - nonvoid subset - polynomially convex subset - potentially invertible subset - relatively compact subset - relatively pseudocompact subset - right perfect subset - right unitary subset - strongly dependent subset - strongly positive subset - totally ordered subset - uniformly integrable subset - universally measurable subset - weakly bounded subset - weakly closed subset - weakly invariant subset - weak-star closed subset - well ordered subset - well separated subset -
5 relation
1) зависимость, (взаимо)связь2) отношение; соотношение4) геол. условия залегания•- almost universal relation - cause-effect relation - generalized semigroup relation - logically irreducible relation - parametrically definable relation - partial ordering relation - recursively enumerable relation - recursively invariant relation - recursively representable relation - strongly definable relation - weakly symmetric relation
См. также в других словарях:
Recursively enumerable set — In computability theory, traditionally called recursion theory, a set S of natural numbers is called recursively enumerable, computably enumerable, semidecidable, provable or Turing recognizable if: There is an algorithm such that the set of… … Wikipedia
Recursively enumerable language — In mathematics, logic and computer science, a recursively enumerable language is a type of formal language which is also called partially decidable or Turing acceptable. It is known as a type 0 language in the Chomsky hierarchy of formal… … Wikipedia
Fuzzy logic — is a form of multi valued logic derived from fuzzy set theory to deal with reasoning that is approximate rather than precise. Just as in fuzzy set theory the set membership values can range (inclusively) between 0 and 1, in fuzzy logic the degree … Wikipedia
Maximal set — In recursion theory, the mathematical theory of computability, a maximal set is a coinfinite recursively enumerable subset A of the natural numbers such that for every further recursively enumerable subset B of the natural numbers, either B is… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
mathematics, foundations of — Scientific inquiry into the nature of mathematical theories and the scope of mathematical methods. It began with Euclid s Elements as an inquiry into the logical and philosophical basis of mathematics in essence, whether the axioms of any system… … Universalium
Presentation of a group — In mathematics, one method of defining a group is by a presentation. One specifies a set S of generators so that every element of the group can be written as a product of some of these generators, and a set R of relations among those generators.… … Wikipedia
List of first-order theories — In mathematical logic, a first order theory is given by a set of axioms in somelanguage. This entry lists some of the more common examples used in model theory and some of their properties. PreliminariesFor every natural mathematical structure… … Wikipedia
Computable function — Total recursive function redirects here. For other uses of the term recursive function , see Recursive function (disambiguation). Computable functions are the basic objects of study in computability theory. Computable functions are the formalized … Wikipedia
